Unconditionally Secure All-Or-Nothing Disclosure of Secrets
نویسنده
چکیده
Alice has n secrets which she regards as equally valuable. She is willing to sell any of them to Bob, but wants to ensure that if he pays for only one secret he cannot obtain any information about the others. Bob would like to buy one of the secrets from Alice, but wants to ensure that Alice can obtain no information about which of her secrets he has obtained. The aim of an all-or-nothing disclosure of secrets cryptographic protocol is to allow Alice and Bob to satisfy these superficially irreconcilable wishes. We show that such a protocol can be carried out securely by using quantum information. The protocol can be modified to implement oblivious transfers in which Bob receives a secret randomly chosen from the n. PACS numbers: 03.65.Bz, 42.50.Dv, 89.70.+c Electronic address: [email protected]
منابع مشابه
Unconditionally Secure All-or-Nothing Disclosure of Secrets Based on POVM Measurements*
Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtai...
متن کاملTwo Novel and Secure Quantum ANDOS Schemes
A vendor has several secrets which he regards as of equal worth and importance. He is willing to sell any of these secrets to a buyer. The bargain is said to be secure when the following two conditions are satisfied: 1) the buyer can only obtain one secret if he pays for only one secret, and 2) the vendor will not be able to find out which secret the buyer picked. This cryptographic problem is ...
متن کاملAll-or-Nothing Disclosure of Secrets
Alice disposes of some number of secrets. She is willing to disclose one of them to Bob. Although she agrees to let him choose wich secret he wants, she is not willing to allow him to gain any information on more than one secret. On the other hand, Bob does not want Alice to know which secret he wishes. This is a useful building block in crypto-protocols. For instance, it can be used to easily ...
متن کاملA New and Efficient All-Or-Nothing Disclosure of Secrets Protocol
Two-party protocols have been considered for a long time. Currently, there is a renewed effort to revisit specific protocols to gain efficiency. As an example, one may quote the breakthrough of [BF97], bringing a new solution to the problem of secretly generating RSA keys, which itself goes back to the pioneering work by Yao [Yao86]. The AllOr-Nothing Disclosure of Secrets protocol (ANDOS) was ...
متن کاملA Novel Unconditionally Secure Multi-Secret Sharing Scheme
A multi-secret sharing scheme is a protocol to share some arbitrarily related secrets among a set of participants. A novel ) , ( n k -threshold multi-secret sharing scheme based on an isomorphism is proposed in this paper. The maximum number of secrets that can be shared in the proposed scheme is 2 k which is larger than that of most existing efficient ) , ( n k -threshold multi-secret sharing ...
متن کامل